-
1 Hamilton digraph
Электроника: гамильтонов орграф (= Hamiltonian digraph) -
2 Hamilton digraph
= Hamiltonian digraph гамильтонов орграф -
3 Hamilton digraph
= Hamiltonian digraph гамильтонов орграфThe New English-Russian Dictionary of Radio-electronics > Hamilton digraph
-
4 digraph
= directed graph1) ориентированный граф, орграф2) вчт диграф (совокупность двух соседних символов, произносимая как один звук)3) вчт диграмма, биграмма•- acyclic digraphdigraphs equivalent up to conversion — орграфы, эквивалентные относительно обращения
- complete digraph
- connected digraph
- Euler digraph
- Eulerian digraph
- functional digraph
- Hamilton digraph
- Hamiltonian digraph
- iterated line digraphs
- labeled connected digraph
- point-symmetric digraph
- self-converse digraph
- signed digraph
- strongly connected digraph
- transitive digraph
- unilateral digraph
- weakly connected digraph -
5 digraph
сокр. от directed graph1) ориентированный граф, орграф2) вчт. диграф (совокупность двух соседних символов, произносимая как один звук)3) вчт. диграмма, биграмма•- complete digraphdigraphs equivalent up to conversion — орграфы, эквивалентные относительно обращения
- connected digraph
- digraph of graph
- Euler digraph
- Eulerian digraph
- functional digraph
- Hamilton digraph
- Hamiltonian digraph
- iterated line digraphs
- labeled connected digraph
- point-symmetric digraph
- self-converse digraph
- signed digraph
- strongly connected digraph
- transitive digraph
- unilateral digraph
- weakly connected digraphThe New English-Russian Dictionary of Radio-electronics > digraph
-
6 Hamiltonian digraph
English-Russian electronics dictionary > Hamiltonian digraph
-
7 Hamiltonian digraph
The New English-Russian Dictionary of Radio-electronics > Hamiltonian digraph
См. также в других словарях:
American and British English spelling differences — Spelling differences redirects here. For other uses, see Category:Language comparison. For guidelines on dialects and spelling in the English language version of Wikipedia, see Wikipedia:Manual of Style#National varieties of English. Differences… … Wikipedia
Richard E. Bellman — Infobox Systems scientist H region = Control Theory era = 20th century color = #B0C4DE image caption = name = Richard E. Bellman birth = birth date|1920|8|26|df=y New York City, New York death = death date and age|1984|3|19|1920|8|26|df=y school… … Wikipedia
Yogh — Not to be confused with the unrelated ʒ. For the rune transcribed as ȝ , see Gyfu. The letter yogh (latinx|Ȝ latinx|ȝ; Middle English: latinx|ȝogh) was used in Middle English and Middle Scots, representing y (IPA|/j/) and various velar phonemes.… … Wikipedia
Greek alphabet — Type Alphabet … Wikipedia
Tournament (graph theory) — Tournament A tournament on 4 vertices Vertices n Edges … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Bellman-Ford algorithm — The Bellman–Ford algorithm, a label correcting algorithm [cite web |url=http://www.mit.edu/people/dimitrib/SLF.pdf |title=A Simple and Fast Label Correcting Algorithm for Shortest Paths |accessdate=2008 10 01 |author=Dimitri P. Bertsekas… … Wikipedia
History of the Greek alphabet — The History of the Greek alphabet starts with the adoption of Phoenician letter forms and continues to the present day. This article concentrates on the early period, before the codification of the now standard Greek alphabet. The Phoenician… … Wikipedia
